Signed Edge Total Domination on Rooted Product Graphs

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the signed Roman edge k-domination in graphs

Let $kgeq 1$ be an integer, and $G=(V,E)$ be a finite and simplegraph. The closed neighborhood $N_G[e]$ of an edge $e$ in a graph$G$ is the set consisting of $e$ and all edges having a commonend-vertex with $e$. A signed Roman edge $k$-dominating function(SREkDF) on a graph $G$ is a function $f:E rightarrow{-1,1,2}$ satisfying the conditions that (i) for every edge $e$of $G$, $sum _{xin N[e]} f...

متن کامل

Nonnegative signed total Roman domination in graphs

‎Let $G$ be a finite and simple graph with vertex set $V(G)$‎. ‎A nonnegative signed total Roman dominating function (NNSTRDF) on a‎ ‎graph $G$ is a function $f:V(G)rightarrow{-1‎, ‎1‎, ‎2}$ satisfying the conditions‎‎that (i) $sum_{xin N(v)}f(x)ge 0$ for each‎ ‎$vin V(G)$‎, ‎where $N(v)$ is the open neighborhood of $v$‎, ‎and (ii) every vertex $u$ for which‎ ‎$f(u...

متن کامل

Signed total Italian k-domination in graphs

Let k ≥ 1 be an integer, and let G be a finite and simple graph with vertex set V (G). A signed total Italian k-dominating function (STIkDF) on a graph G is a functionf : V (G) → {−1, 1, 2} satisfying the conditions that $sum_{xin N(v)}f(x)ge k$ for each vertex v ∈ V (G), where N(v) is the neighborhood of $v$, and each vertex u with f(u)=-1 is adjacent to a vertex v with f(v)=2 or to two vertic...

متن کامل

On Signed Edge Total Domination Numbers of Graphs

For the terminology and notations not defined here, we adopt those in Bondy and Murty [1] and Xu [2] and consider simple graphs only. Let G = (V,E) be a graph with vertex set V = V (G) and edge set E = E(G). For any vertex v ∈ V , NG(v) denotes the open neighborhood of v in G and NG[v] = NG(v) ∪ {v} the closed one. dG(v) = |NG(v)| is called the degree of v in G, ∆ and δ denote the maximum degre...

متن کامل

Signed total Roman k-domination in directed graphs

Let $D$ be a finite and simple digraph with vertex set $V(D)$‎.‎A signed total Roman $k$-dominating function (STR$k$DF) on‎‎$D$ is a function $f:V(D)rightarrow{-1‎, ‎1‎, ‎2}$ satisfying the conditions‎‎that (i) $sum_{xin N^{-}(v)}f(x)ge k$ for each‎‎$vin V(D)$‎, ‎where $N^{-}(v)$ consists of all vertices of $D$ from‎‎which arcs go into $v$‎, ‎and (ii) every vertex $u$ for which‎‎$f(u)=-1$ has a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annals of Pure and Applied Mathematics

سال: 2018

ISSN: 2279-087X,2279-0888

DOI: 10.22457/apam.v17n1a10